Dynamic programming, decision tables, and the Hawaii Parallel Computer
نویسندگان
چکیده
منابع مشابه
Programming the Hawaii Parallel Computer
A new application of field programmable gate-arrays is featured in the prototype of the University of Hawaii parallel computer (HPC). User programs are compiled and then executed partly or completely in one or more field programmable gate-arrays (FPGAs). Some compile-for-FPGA systems have yet to effectively implement full high-level language loop constructs. In this paper we show how the condit...
متن کاملDecision Diagrams and Dynamic Programming
Binary and multivalued decision diagrams are closely related to dynamic programming (DP) but differ in some important ways. This paper makes the relationship more precise by interpreting the DP state transition graph as a weighted decision diagram and incorporating the state-dependent costs of DP into the theory of decision diagrams. It generalizes a well-known uniqueness theorem by showing tha...
متن کاملParallel Dynamic Programming
We study the parallel computation of dynamic programming. We consider four important dynamic programming problems which have wide application, and that have been studied extensively in sequential computation: (1) the 1D problem, (2) the gap problem, (3) the parenthesis problem, and (4) the RNA problem. The parenthesis problem has fast parallel algorithms; almost no work has been done for parall...
متن کاملParallel Dynamic Programming using Data - Parallel Skeletons ∗
For demonstrating the powerfulness of skeletal programming we have developed a parallelization technique toward one class of optimization problems called maximum marking problems, which can be recognized as one class of dynamic programming. This paper, as in the course of an ongoing research, focuses on problems of dynamic programming in general, and examines how the skeletal approach successfu...
متن کاملLock-free parallel dynamic programming
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the order in which the dynamic program computes its subproblems. This generic approach is applied to dynamic programs for knapsack, shortest paths, and RNA structure alignment, as well as to a state-of-the-art solution for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1994
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)90130-9